package codeTop;

public class q62 {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        dp[0][0] = 1;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (i - 1 >= 0) {
                    dp[i][j]+=dp[i-1][j];
                }
                if (j - 1 >= 0) {
                    dp[i][j]+=dp[i][j-1];
                }
            }
        }
        return dp[m-1][n-1];
    }

    public static void main(String[] args) {
        q62 q = new q62();
        System.out.println(q.uniquePaths(3, 7));
    }
}
